Algorithms for Point Processes Analysis
نویسنده
چکیده
A time point process can be defined either by the statistical properties of the time intervals between successive points or by those of the number of points in arbitrary time intervals. There are mathematical expressions to link up these two points of view, but they are in many cases too complicated to be used in practice. In this paper we present an algorithmic procedure to obtain the number of points of a stationary point process recorded in some time intervals by processing the values of the distances between successive points. We present some results concerning the statistical analysis of these numbers of points and when analytical calculations are possible the experimental results obtained with our algorithms are in excellent agreement with those predicted by the theory. Some properties of point processes in which theoretical calculations are almost impossible are also presented. Some key words. Point processes, renewal processes, lifetime, counting. Unité mixte de recherche (UMR 8506) du Centre national de la recherche scientifique (CNRS), de l’École supérieure d’électricité (Suplec) et de l’Université de Paris-Sud 11 (UPS). 1 ha l-0 07 93 38 5, v er si on 1 22 F eb 2 01 3 Author manuscript, published in "Communications in Statistics Simulation and Computation 42, 1 (2013) 90-106" DOI : 10.1080/03610918.2011.633197
منابع مشابه
On new faster fixed point iterative schemes for contraction operators and comparison of their rate of convergence in convex metric spaces
In this paper we present new iterative algorithms in convex metric spaces. We show that these iterative schemes are convergent to the fixed point of a single-valued contraction operator. Then we make the comparison of their rate of convergence. Additionally, numerical examples for these iteration processes are given.
متن کاملComprehensive Analysis of Dense Point Cloud Filtering Algorithm for Eliminating Non-Ground Features
Point cloud and LiDAR Filtering is removing non-ground features from digital surface model (DSM) and reaching the bare earth and DTM extraction. Various methods have been proposed by different researchers to distinguish between ground and non- ground in points cloud and LiDAR data. Most fully automated methods have a common disadvantage, and they are only effective for a particular type of surf...
متن کاملStrong convergence of modified iterative algorithm for family of asymptotically nonexpansive mappings
In this paper we introduce new modified implicit and explicit algorithms and prove strong convergence of the two algorithms to a common fixed point of a family of uniformly asymptotically regular asymptotically nonexpansive mappings in a real reflexive Banach space with a uniformly G$hat{a}$teaux differentiable norm. Our result is applicable in $L_{p}(ell_{p})$ spaces, $1 < p
متن کاملAERO-THERMODYNAMIC OPTIMIZATION OF TURBOPROP ENGINES USING MULTI-OBJECTIVE GENETIC ALGORITHMS
In this paper multi-objective genetic algorithms were employed for Pareto approach optimization of turboprop engines. The considered objective functions are used to maximize the specific thrust, propulsive efficiency, thermal efficiency, propeller efficiency and minimize the thrust specific fuel consumption. These objectives are usually conflicting with each other. The design variables consist ...
متن کاملA comprehensive benchmark between two filter-based multiple-point simulation algorithms
Computer graphics offer various gadgets to enhance the reconstruction of high-order statistics that are not correctly addressed by the two-point statistics approaches. Almost all the newly developed multiple-point geostatistics (MPS) algorithms, to some extent, adapt these techniques to increase the simulation accuracy and efficiency. In this work, a scrutiny comparison between our recently dev...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Communications in Statistics - Simulation and Computation
دوره 42 شماره
صفحات -
تاریخ انتشار 2013